Lambda: the ultimate syntax-semantics interface

نویسندگان

  • Oleg Kiselyov
  • Chung-chieh Shan
چکیده

Spreadsheets in accounting and Matlab in engineering are immensely popular because these glorified calculators let domain experts play : write down a problem in familiar terms and quickly try a number of solutions. Natural-language semanticists have a better tool. Not only does it compute grammar yields and truth values, it also infers types, normalizes terms, and displays truth conditions as formulas. Its modularity facilities make it easy to try fragments out, scale them up, and abstract encoding details out of semantic theories. This tool is a combination of techniques created by functional programmers, who are as unaware of its application to semantics as most semanticists. This paper breaks the barrier. We express extensible interpreters of naturaland formal-language fragments as functional programs. Specifically, we work our way from the simply-typed lambda calculus and a context-free grammar to a dynamic treatment of quantification and anaphora. We strive to be comprehensible and informative to both linguists and programmers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cross-linguistic Influence at Syntax-pragmatics Interface: A Case of OPC in Persian

Recent research in the area of Second Language Acquisition has proposed that bilinguals and L2 learners show syntactic indeterminacy when syntactic properties interface with other cognitive domains. Most of the research in this area has focused on the pragmatic use of syntactic properties while the investigation of compliance with a grammatical rule at syntax-related interfaces has not received...

متن کامل

CMSC631 Program Analysis and Understanding: Class notes

2 Syntax, Semantics, & Machines for Arithmetic 4 2.1 Modelling Syntax with Inductive Sets . . . . . . . . . . . . . . . . . . . . . 4 2.2 Modelling Syntax with Data . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.3 Natural Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.4 Reduction Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 ...

متن کامل

Reverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages

Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...

متن کامل

FUNDIO: A Lambda-Calculus With letrec, case, Constructors, and an IO-Interface: Approaching a Theory of unsafePerformIO Technical Report Frank-16

This paper proposes a non-standard way to combine lazy functional languages with I/O. In order to demonstrate the usefulness of the approach, a tiny lazy functional core language “FUNDIO”, which is also a call-by-need lambda calculus, is investigated. The syntax of “FUNDIO” has case, letrec, constructors and an IO-interface: its operational semantics is described by small-step reductions. A con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013